Papers with relational tables
Leveraging 2-hop Distant Supervision from Table Entity Pairs for Relation Extraction (D19-1)
Copied to clipboard
| Challenge: | Existing methods to construct noisy labeled data for relation extraction (RE) are expensive and lacks the labeling capability. |
| Approach: | They propose a 2-hop DS strategy to enhance distantly supervised relation extraction (RE) by combining sentences that mention entities that are linked to each other. |
| Outcome: | The proposed method outperforms baselines on a benchmark dataset by a substantial margin. |
RelationalCoder: Rethinking Complex Tables via Programmatic Relational Transformation (2025.acl-long)
Copied to clipboard
| Challenge: | Semi-structured tables remain a major obstacle for automated data processing and analytics. |
| Approach: | They propose a technique called Loop Reference Decoding which identifies expandable groups and replicates each group using a concise loop over its repetitive region. |
| Outcome: | The proposed technique reduces output length from O(N M) to approximately O(K) Extensive experiments on HiTab and MultiHiertt show that it boosts Llama-2 and Mistral models by more than 20%, and GPT-4o by over 4%. |
Know What I don’t Know: Handling Ambiguous and Unknown Questions for Text-to-SQL (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing text-to-SQL parsers generate a plausible SQL query for arbitrary user questions, thereby failing to handle problematic user questions. |
| Approach: | They propose a weakly supervised DTE model for error detection, localization, and explanation. |
| Outcome: | The proposed model achieves the best result on real-world examples and generated examples compared with baselines. |
MATE: Multi-view Attention for Table Transformer Efficiency (2021.emnlp-main)
Copied to clipboard
| Challenge: | Tables are ubiquitous on the web, and are rich in information. |
| Approach: | They propose a sparse-attention Transformer architecture for modeling documents that contain large tables. |
| Outcome: | The proposed architecture scales linearly with respect to speed and memory, and can handle documents containing more than 8000 tokens with current accelerators. |